DE eng

Search in the Catalogues and Directories

Hits 1 – 17 of 17

1
Multilingual Unsupervised Sentence Simplification
In: https://hal.inria.fr/hal-03109299 ; 2021 (2021)
BASE
Show details
2
Controllable Sentence Simplification
In: LREC 2020 - 12th Language Resources and Evaluation Conference ; https://hal.inria.fr/hal-02678214 ; LREC 2020 - 12th Language Resources and Evaluation Conference, May 2020, Marseille, France ; http://www.lrec-conf.org/proceedings/lrec2020/index.html (2020)
BASE
Show details
3
ASSET: A Dataset for Tuning and Evaluation of Sentence Simplification Models with Multiple Rewriting Transformations
In: ACL 2020 - 58th Annual Meeting of the Association for Computational Linguistics ; https://hal.inria.fr/hal-02889823 ; ACL 2020 - 58th Annual Meeting of the Association for Computational Linguistics, Jul 2020, Seattle / Virtual, United States (2020)
BASE
Show details
4
Augmenting Transformers with KNN-Based Composite Memory for Dialog
In: EISSN: 2307-387X ; Transactions of the Association for Computational Linguistics ; https://hal.archives-ouvertes.fr/hal-02999678 ; Transactions of the Association for Computational Linguistics, The MIT Press, In press, ⟨10.1162/tacl_a_00356⟩ ; https://transacl.org/index.php/tacl (2020)
BASE
Show details
5
MUSS: Multilingual Unsupervised Sentence Simplification by Mining Paraphrases ...
Abstract: Progress in sentence simplification has been hindered by a lack of labeled parallel simplification data, particularly in languages other than English. We introduce MUSS, a Multilingual Unsupervised Sentence Simplification system that does not require labeled simplification data. MUSS uses a novel approach to sentence simplification that trains strong models using sentence-level paraphrase data instead of proper simplification data. These models leverage unsupervised pretraining and controllable generation mechanisms to flexibly adjust attributes such as length and lexical complexity at inference time. We further present a method to mine such paraphrase data in any language from Common Crawl using semantic sentence embeddings, thus removing the need for labeled data. We evaluate our approach on English, French, and Spanish simplification benchmarks and closely match or outperform the previous best supervised results, despite not using any labeled simplification data. We push the state of the art further by ...
Keyword: Computation and Language cs.CL; FOS Computer and information sciences; Machine Learning cs.LG
URL: https://dx.doi.org/10.48550/arxiv.2005.00352
https://arxiv.org/abs/2005.00352
BASE
Hide details
6
ASSET: A Dataset for Tuning and Evaluation of Sentence Simplification Models with Multiple Rewriting Transformations ...
BASE
Show details
7
ASSET: A dataset for tuning and evaluation of sentence simplification models with multiple rewriting transformations
BASE
Show details
8
Controllable Sentence Simplification
In: https://hal.inria.fr/hal-02445874 ; 2019 (2019)
BASE
Show details
9
Controllable Sentence Simplification ...
BASE
Show details
10
Reference-less Quality Estimation of Text Simplification Systems
In: 1st Workshop on Automatic Text Adaptation (ATA) ; https://hal.inria.fr/hal-01959054 ; 1st Workshop on Automatic Text Adaptation (ATA), Nov 2018, Tilburg, Netherlands ; https://www.ida.liu.se/~evere22/ATA-18/ (2018)
BASE
Show details
11
Fader Networks: Manipulating Images by Sliding Attributes
In: 31st Conference on Neural Information Processing Systems (NIPS 2017) ; https://hal.archives-ouvertes.fr/hal-02275215 ; 31st Conference on Neural Information Processing Systems (NIPS 2017), Dec 2017, Long Beach, CA, United States. pp.5969-5978 (2017)
BASE
Show details
12
Extracting biomedical events from pairs of text entities
In: ISSN: 1471-2105 ; BMC Bioinformatics ; https://hal.archives-ouvertes.fr/hal-01313324 ; BMC Bioinformatics, BioMed Central, 2015, 16 (Suppl 10), pp.S8. ⟨10.1186/1471-2105-16-S10-S8⟩ ; http://bmcbioinformatics.biomedcentral.com/articles/10.1186/1471-2105-16-S10-S8 (2015)
BASE
Show details
13
Open Question Answering with Weakly Supervised Embedding Models
In: European Conference (ECML PKDD 2014) ; https://hal.archives-ouvertes.fr/hal-01344007 ; European Conference (ECML PKDD 2014), Sep 2014, nancy, France. pp.165-180, ⟨10.1007/978-3-662-44848-9_11⟩ (2014)
BASE
Show details
14
Fast recursive multi-class classification of pairs of text entities for biomedical event extraction
In: Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics ; https://hal.archives-ouvertes.fr/hal-01060830 ; Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics, Apr 2014, Gothenburg, Sweden. pp.692--701 (2014)
BASE
Show details
15
Open Question Answering with Weakly Supervised Embedding Models ...
BASE
Show details
16
Towards Understanding Situated Natural Language
In: 13th International Conference on Artificial Intelligence and Statistics ; https://hal.archives-ouvertes.fr/hal-00750937 ; 13th International Conference on Artificial Intelligence and Statistics, May 2010, Chia Laguna Resort, Sardinia, Italy. pp.65-72 (2010)
BASE
Show details
17
Extracting biomedical events from pairs of text entities
In: ISSN: 1471-2105 ; BMC Bioinformatics ; https://hal.archives-ouvertes.fr/hal-01278279 ; BMC Bioinformatics, BioMed Central, 2005, 16 (Suppl 10), pp.S8. ⟨10.1186/1471-2105-16-S10-S8⟩ ; http://bmcbioinformatics.biomedcentral.com/articles/10.1186/1471-2105-16-S10-S8 (2005)
BASE
Show details

Catalogues
0
0
0
0
0
0
0
Bibliographies
0
0
0
0
0
0
0
0
0
Linked Open Data catalogues
0
Online resources
0
0
0
0
Open access documents
17
0
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern